A New Framework of Very Large Knowledge-bases | from Database and Constraint Logic Programming Points of View
نویسندگان
چکیده
There are many knowledge representation and programming languages, and problem solvers for various applications. The increasing requirements of applications and the changes of computing environment require the cooperation and integration of existing languages and systems, because many applications cannot be necessarily represented by a single language, processed by a single problem solver and a single computing environment, and located in a single place. In this paper, we propose a new framework of heterogeneous, distributed problem solving, which corresponds to very large knowledge-bases consisting of multiple heterogeneous knowledge-bases and databases, for more complex applications. Our model consists of two concepts: agent and environment. An agent is an autonomous problem solver or a knowledge-base, which may be nested with an environment and multiple (heterogeneous) agents, where an environment provides a common space where agents communicate each other. We also show the representability and adaptability of this simple model by using some examples.
منابع مشابه
An adaptation of Constraint Handling Rules for Interactive and Intelligent Installations
Constraint Handling Rules, CHR, have proved to be effective for a large range of reasoning tasks, which makes it interesting in different sorts of interactive installations. Typically, such an installation involves a large number of cooperating software components that need to refer to a common knowledge. Using CHR’s constraint stores as a knowledge representation may be appealing from a theore...
متن کاملVOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES
In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...
متن کاملA Temporal-Probabilistic Database Model for Information Extraction
Temporal annotations of facts are a key component both for building a high-accuracy knowledge base and for answering queries over the resulting temporal knowledge base with high precision and recall. In this paper, we present a temporalprobabilistic database model for cleaning uncertain temporal facts obtained from information extraction methods. Specifically, we consider a combination of tempo...
متن کاملA Declarative Approach to View Selection Modeling
View selection is important in many data-intensive systems e.g., commercial database and data warehousing systems. Given a database (or a data warehouse) schema and a query workload, view selection is to choose an appropriate set of views to be materialized that optimizes the total query cost, given a limited amount of resource, e.g., storage space and total view maintenance cost. The view sele...
متن کامل1 Constraint Programming in Constraint
1.1 Abstract We view constraints as relations and constraint satisfaction as a dynamic process of approaching the solution set of the constraints. We have developed a semantic model for dynamic systems, called Constraint Nets, to provide a real-time programming semantics and to model and analyze dynamic systems. In this paper, we explore the relationship between constraint satisfaction and cons...
متن کامل